Papers with relation identification
End-to-End Argument Mining as Biaffine Dependency Parsing (2021.eacl-main)
Copied to clipboard
| Challenge: | Argumentation mining (AM) is a new field of research that uses dependency parsing to analyse arguments. |
| Approach: | They propose a neural end-to-end approach to argument mining based on dependency parsing . their model is biaffine dependency parsed and outperforms the current state-of-the-art . |
| Outcome: | The proposed model outperforms the state-of-the-art in component identification and relation identification. |
Implicit Discourse Relation Identification for Open-domain Dialogues (P19-1)
Copied to clipboard
| Challenge: | Discourse relation identification is a challenging problem in open-domain dialogue systems . previous work relies on formal text but this data is not suitable for informal dialogue . |
| Approach: | They propose a method to automatically extract the implicit discourse relation argument pairs from dialogic turns and a pipeline to identify them. |
| Outcome: | The proposed pipeline extracts argument pairs from dialogic turns and improves it by performing feature ablation and incorporating dialogue features. |
Frowning Frodo, Wincing Leia, and a Seriously Great Friendship: Learning to Classify Emotional Relationships of Fictional Characters (N19-1)
Copied to clipboard
| Challenge: | Existing literature analysis does not focus on roles of characters or on relationships between them. |
| Approach: | They propose to combine emotion and character identification into a unified framework for character network extraction from fictional texts. |
| Outcome: | The proposed task is based on fan-fiction short stories and is able to predict emotion relations in the extracted network graph. |
Exploiting Entity BIO Tag Embeddings and Multi-task Learning for Relation Extraction with Imbalanced Data (P19-1)
Copied to clipboard
| Challenge: | Existing methods to perform relation extraction are feature-based or kernel-based, but the results of our study show that they can improve the performance of a baseline model with more than 10% absolute increase in F1-score. |
| Approach: | They propose a multi-task architecture which jointly trains a model to perform relation identification with cross-entropy loss and relation classification with ranking loss. |
| Outcome: | The proposed model outperforms the state-of-the-art models on ACE 2005 Chinese and English corpus and significantly improves the performance of a baseline model with more than 10% increase in F1-score. |
Universal Dependencies According to BERT: Both More Specific and More General (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that individual BERT heads encode particular dependency relation types, but they do not match one-to-one. |
| Approach: | They propose a method for relation identification and syntactic tree construction that can be applied with minimal supervision and generalizes well across languages. |
| Outcome: | The proposed method produces significantly more consistent dependency trees than previous work and can be applied with only a minimal amount of supervision and generalizes well across languages. |
LLM as a metric critic for low resource relation identification (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies show that small language models (SLMs) overfit in low resource situations . however, the gap between pre-training and fine-tuning leads to performance decay . |
| Approach: | They propose to combine large language models and LLM for relation identification by co-evolution . they propose to use a masked language model prompt to generate a relation identification task . |
| Outcome: | The proposed model can handle low resource relation identification tasks with minimal overfitting . the proposed model provides essential background knowledge to assist training process . |